Implementing Prioritized Logic Programming
نویسندگان
چکیده
Connict resolution is an important issue in knowledge representation and reasoning. A common idea of solving connicts in reasoning is to introduce priorities in the underlying reasoning mechanism. This paper describes an implementation of prioritized logic programs (PLPs) proposed by Zhang and Foo recently 4]. PLPs is a non-trivial extension of Gelfond and Lifschitz's extended logic programs 3] by associating preferences to the program, where answer sets provide a semantics of PLPs. As a central part of the implementation of PLPs, we present major algorithms of computing answer sets of PLPs. We show how answer sets of a PLP can be computed eeciently based on previous Niemell a and Simons' method of computing stable models of logic programs 2].
منابع مشابه
Implementing Prioritized Circumscription by Computing Disjunctive Stable Models
The stable model semantics of disjunctive logic programs is based on minimal models which assign atoms false by default. While this feature is highly useful and leads to concise problem encodings, it occasionally makes knowledge representation with disjunctive rules difficult. Lifschitz’ parallel circumscription provides a remedy by introducing atoms that are allowed to vary or to have fixed va...
متن کاملProperties of Prioritized Logic
Prioritized logic programming has illustrated its rich expres-siveness and exibility in knowledge representation and reasoning. However , some important aspects of prioritized logic programs have yet to be thoroughly explored. In this paper, we investigate several properties of prioritized logic programs in the context of answer set semantics. Specifically , we propose a characterization on the...
متن کاملTwo results for prioritized logic programming
Prioritized default reasoning has illustrated its rich expressiveness and flexibility in knowledge representation and reasoning. However, many important aspects of prioritized default reasoning have yet to be thoroughly explored. In this paper, we investigate two properties of prioritized logic programs in the context of answer set semantics. Specifically, we reveal a close relationship between...
متن کاملIbm Research Report Courteous Logic Programs: Prioritized Connict Handling for Rules
We de ne courteous logic programs, an expressive superclass of general logic programs, for the acyclic case. Courteous LP's feature not only classical negation as in extended LP's (Gelfond & Lifschitz), but also prioritized conict handling. We show courteous LP's always have a consistent and unique answer set, which can be computed in O(m2) time, where m is the size of the ground-instantiated p...
متن کاملRepresenting Priorities in Logic Programs
Reasoning with priorities is a central topic in knowledge representation. A number of techniques for prioritized reasoning have been developed in the eld of AI, but existing logic programming lacks the mechanism of explicit representation of priorities in a program. In this paper, we introduce a framework for representing priorities in logic programming. Prioritized logic programming represents...
متن کامل